Constructive Solid Geometry with Projection: An Approach to Piano Movers’ Problem
نویسنده
چکیده
Configuration space obstacles are regions in a configuration space which represent forbidden configuration of the object due to the presence of other objects. They can be regarded as geometric objects which are representable using Boolean combinations of equations and inequalities. Moreover, they can also be represented using existential quantifiers which correspond to geometric projections. If the projected variables only occur algebraically then it is possible to eliminate quantifiers and represent configuration space obstacles in the semi-algebraic form. However, no matter how it is done, the quantifier elimination is computationally hard and the output in semi-algebraic representation is often large and cumbersome. Therefore, we are looking for a possibility to work directly with the quantified representation of the configuration space obstacles. We investigate combination of tools which can be used in conjunction with this quantified representation. The main idea is the use of interval evaluation on equations and inequalities involving some transcendental functions. We suggested an extended version of Constructive Solid Geometry system which has trigonometric functions as well as the usual Boolean operators. The combination of this system together with interval arithmetic allows simplification and spatial subdivision and pruning to be done in a natural way. We also raise the possibility of an extended Constructive Solid Geometry system which would have projection and boundary formation as operators. This would allow compact representation of the configuration space, but presents computational problems which are, as yet, unsolved. ? Supported by the scholarship Technolgiestipendien Südostasien 2005/2006 (Postdoc) awarded by the Austrian Exchange Service – Agency for International Cooperation in Education and Research (ÖAD), Academic Cooperation and Mobility (ACM).
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملCollision detection for objects modelled by CSG
Physically based computer animation has to deal with the problem of detecting collisions of moving objects and preventing solid objects from interpenetration. This paper discusses a method for detecting collisions among complex objects modelled with the constructive solid geometry paradigm. Bounding volumes in each node of the CSG tree are used to determine as soon as possible whether a collisi...
متن کاملRay Tracing Multiple Minkowski Sums: a Csg Approach
The repertoire of set operators available in Constructive Solid Geometry (CSG) may be extended by the Minkowski addition and subtraction operators. In this way the problem of visualizing 3D solids deened as a Minkowski addition or subtraction of elementary objects can be solved by using CSG in combination with ray tracing. The method consists in transforming a Minkowski term with multiple opera...
متن کاملA "Piano Movers" Problem Reformulated
It has long been known that cylindrical algebraic decompositions (CADs) can in theory be used for robot motion planning. However, in practice even the simplest examples can be too complicated to tackle. We consider in detail a “Piano Mover’s Problem” which considers moving an infinitesimally thin piano (or ladder) through a right-angled corridor. Producing a CAD for the original formulation of ...
متن کاملStructural topology optimization using multi-objective genetic algorithm with constructive solid geometry representation
This paper proposes a constructive solid geometry based approach (named CG-TOM) for structural topology optimization. The use of evolutionary algorithms for topology optimisation is considered ineffective due to a considerably large number of topological design variables. To alleviate this problem, a novel representation scheme is proposed, which encodes the topology using position of few joint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006